Array%2DTree A persistent data structure to compactly store frequent itemsets.

Analysis of Medical Pathways by Means of Frequent Closed Sequences.

A persistent HY%2DTree to efficiently support itemset mining on large datasets.

Constrained itemset mining on a sequence of incoming data blocks.

IMine Index Support for Item Set Mining.

Compact Representations of Sequential Classification Rules.

Applying sequential rules to protein localization prediction.

A Lazy Approach to Associative Classification.

Index Support for Frequent Itemset Mining in a Relational DBMS.

Index Support for Mining Data Streams in a Relational DBMS.

On support thresholds in associative classification.

Frequent Itemset Mining in a Relational DBMS.

Essential classification rule sets.
Abstract—This paper studies a problem of robust rule-based classification, i.e., making predictions in the presence of missing values in data. This study differs from other missing value handling research in that it does not handle missing values but builds a rule-based classification model to tolerate missing values. Based on a commonly used rule-based classification model, we characterize the robustness of a hierarchy of rule sets as k-optimal rule sets with the decreasing size corresponding to the decreasing robustness. We build classifiers based on k-optimal rule sets and show experimentally that they are more robust than some benchmark rule-based classifiers, such as C4.5rules and CBA. We also show that the proposed approach is better than two well-known missing value handling methods for missing values in test data. Index Terms—Data mining, rule, classification, robustness. 1

Designing and Testing High Dependable Memories for Aerospace Applications.


DFT and BIST of a Multichip Module for High%2DEnergy Physics Experiments.

On applying the set covering model to reseeding.

Online and Offline BIST in IP%2DCore Design.

GRAAL a tool for highly dependable SRAMs generation.

Online and Offline BIST in IP%2DCore Design.

A Self%2DRepairing Execution Unit for Microprogrammed Processors.

Optimal Hardware Pattern Generation for Functional BIST.
Functional BIST is a promising solution for self-testing complex digital systems at reduced costs in terms of area and performance degradation. The present paper addresses the computation of optimal seeds for an arbitrary sequential module to be used as hardware test pattern generator. Up to now, only linear feedback shift registers and accumulator based structures have been used for deterministic test pattern generation by reseeding.
Self%2DRepairing in a Micro%2DProgrammed Processor for Dependable Applications.
This paper presents the on-going activities on the design of a Built-In-Self-Repairable micro-processor for high dependable environments. The processoc designed to pegorm SlSD instructions, is able to on-line dynamically reconfigure its internal micro-code in order to “emulate ” faulty functional blocks using fault-free blocks of the system only. One of the main novelties of our approach is therefore that no redundant or spare computational blocks are added to the system to allow self-repairing. The approach is completely transparent to the usel; and allows a graceful degradation of the device, which is able to complete the requested operations even in presence of multiple faults in its functional units. 1.
A C%2FC   Source%2Dto%2DSource Compiler for Dependable Applications.

%27BOND%27 An Interposition Agents Based Fault Injector for Windows NT.

A C%2FC   Source%2Dto%2DSource Compiler for Dependable Applications.

On Integrating a Proprietary and a Commercial Architecture for Optimal BIST Performances in SoCs.

A Family of Self%2DRepair SRAM Cores.

A COTS Wrapping Toolkit for Fault Tolerant Applications under Windows NT.

A COTS Wrapping Toolkit for Fault Tolerant Applications under Windows NT.

A software development kit for dependable applications in embedded systems.

Non%2Dintrusive BIST for systems%2Don%2Da%2Dchip.
1  The term &#034;functional BIST&#034; describes a test method to control functional modules so that they generate a deterministic test set, which targets structural faults within other parts of the system. It is a promising solution for self-testing complex digital systems at reduced costs in terms of area overhead and performance degradation. While previous work mainly investigated the use of functional modules for generating pseudo-random and pseudo-exhaustive test patterns, the present paper shows that a variety of modules can also be used as a deterministic test pattern generator via an appropriate reseeding strategy. This method enables a BIST technique that does not introduce additional hardware like test points and test registers into combinational and pipelined modules under test. The experimental results prove that the reseeding method works for accumulator based structures, multipliers, or encryption modules as efficiently as for the classic linear feedback shift registers, and some ...
HD%2Fsup 2%2FBIST a hierarchical framework for BIST scheduling

A High%2DLevel EDA Environment for the Automatic Insertion of HD%2DBIST Structures.

Integrating Symbolic Techniques in ATPG%2DBased Sequential Logic Optimization.

HD%2DBIST a hierarchical framework for BIST scheduling and diagnosis in SOCs.

Testing an MCM for high%2Denergy physics experiments a case study.

An on%2Dline BISTed SRAM IP core.

RT%2Dlevel TPG Exploiting High%2DLevel Synthesis Information.

Exploiting Behavioral Information in Gate%2DLevel ATPG.

A Test Pattern Generation Algorithm Exploiting Behavioral Information.

A System for Evaluating On%2DLine Testability at the RT%2Dlevel.

Guaranteeing Testability in Re%2Dencoding for Low Power.

Hybrid symbolic%2Dexplicit techniques for the graph coloring problem.
This paper presents an algorithmic technique based  on hybridizing Symbolic Manipulation Techniques  based on BDDs with more traditional Explicit solving  algorithms. To validate the approach, the graph coloring  problem has been selected as a hard-to-solve problem,  and an optimized solution based on hybrid techniques  has been implemented. Experimental results on a  set of benchmarks derived from the CAD for VLSI area  show the applicability of the approach to graphs with  millions of vertices in a limited CPU time.  1. Introduction  Many search and optimization problems in CAD for  VLSI can be modeled resorting to graph theory. This  motivates the efforts to improve algorithmic solutions to  graph problems and to customize general-purpose algorithms  to special categories of problem instances commonly  found in the electronic CAD field.  Several optimization problems in the CAD area can  be modeled as a Graph Coloring problem. For instance,  register allocation, resource sharing, an...
Cellular automata for deterministic sequential test pattern generation.

Cellular automata for deterministic sequential test pattern generation.

